On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000

Source URL: www.ics.uci.edu

Confluent Hasse Diagrams David Eppstein and Joseph A. Simons University of California, Irvine Goal: • Improve Readability of Hasse Diagrams

Source URL: www.ics.uci.edu

• Structure
• Dedekind–MacNeille completion
• Hasse diagram
• Confluence
• Planar graph
• Dedekind cut
• Partially ordered set
• Order theory
• Graph theory
• Mathematics

trilinear.nb 1 Notes on trilinear coordinates of a triangle David Eppstein

Source URL: www.ics.uci.edu

• Incircle and excircles of a triangle
• Triangle
• Altitude
• Bisection
• Trilinear coordinates
• Law of cosines
• Circle
• Geometry
• Triangle geometry
• Triangles

CURRICULUM VITAE Darren Strash Postdoctoral Researcher Institute of Theoretical Informatics Karlsruhe Institute of Technology Am Fasanengarten 5, R. 206

Source URL: www.ics.uci.edu

• David Eppstein
• Clique
• Algorithm
• Michael T. Goodrich
• Dense graph
• Graph theory
• Mathematics
• Theoretical computer science

Kevin A. Wortman Department of Computer Science California State University, Fullerton 800 N. State College Blvd. Fullerton, CA 92831

Source URL: kwortman.ecs.fullerton.edu

• California
• David Eppstein
• Donald Bren School of Information and Computer Sciences
• California State University
• XPL
• Computer science
• University of California
• Irvine
• Computational geometry
• University of California
• Association of Public and Land-Grant Universities
• American Association of State Colleges and Universities
• Academia

Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and

Source URL: www.ics.uci.edu

• Analysis of algorithms
• Computational geometry
• Probabilistic complexity theory
• Randomized algorithm
• Algorithm
• Time complexity
• Binary search algorithm
• LP-type problem
• Closest pair of points problem
• Theoretical computer science
• Applied mathematics
• Mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Universal Point Sets for Planar Graph Drawings with Circular Arcs Patrizio Angelini∗ David Eppstein†

Source URL: www.cccg.ca

• Graph drawing
• Geometric graph theory
• Graph
• Book embedding
• Outerplanar graph
• Graph theory
• Topological graph theory
• Planar graphs

Call for Posters – Graph Drawing 2014 22nd International Symposium on Graph Drawing September 24-26, 2014 • Würzburg, Germany http://gd2014.informatik.uni-wuerzburg.de/ Graph Drawing is concerned with the geometric

Source URL: lamut.informatik.uni-wuerzburg.de

• Geometry
• International Symposium on Graph Drawing
• Visualization
• David Eppstein
• Poster session
• Graph drawing
• Mathematics
• Graph theory

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Source URL: www.ics.uci.edu

• Data mining
• Machine learning
• Search algorithms
• Cluster analysis
• Image processing
• Hierarchical clustering
• Nearest neighbor search
• UPGMA
• Single-linkage clustering
• Statistics
• Mathematics
• Information science

Call for Papers – Graph Drawing 2014 22nd International Symposium on Graph Drawing September 24-26, 2014 • Würzburg, Germany http://gd2014.informatik.uni-wuerzburg.de/ Graph Drawing is concerned with the geometric r

Source URL: lamut.informatik.uni-wuerzburg.de

• Theoretical computer science
• Topological graph theory
• Geometric graph theory
• International Symposium on Graph Drawing
• Visualization
• David Eppstein
• Graph
• Mathematics
• Graph theory
• Graph drawing